Random unary predicates: Almost sure theories and countable models
نویسندگان
چکیده
منابع مشابه
Random unary predicates: Almost sure theories and countable models
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1). For each k, we give an axiomatization for the theory Tk. We find a model Mk of Tk of order type roughly that of Z and show that no other models of Tk exist of smaller size.
متن کاملSimple structures axiomatized by almost sure theories
In this article we give a classi cation of the binary, simple, ω−categorical structures with SU−rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that they may be approximated by the almost sure theory of some sets of nite structures equipped with a probability measure. This study give results about general almost sur...
متن کاملAlmost Sure Limit Sets of Random Series
I would like to tell you about an easily stated problem which lies at the border of geometry, probability and classical analysis. In the summer of 2005 two undergraduates at McGill University worked in this general area, and were able to make some progress. When posing the project to them I made a certain conjecture, and (as expected) they did not get far enough in their eight week project to b...
متن کاملCountable Models of Stable Theories
The notion of a normal theory is introduced, and it is proved that for such a theory T, /(N„, 7") = 1 or 3e S(l. Wc also include a short proof of Lachlan's theorem that for superstable 7". /(X0, 7") = 1 or > N(1. (The property of normality is stronger than stability but incomparable to superstability.) 1. Preliminaries. We consider here theories T which are countable and complete (and of course...
متن کاملA sufficient condition for super-simplicity of almost-sure theories
In Hill [11], it was shown that an almost-sure theory for a Fraïssé class K relative to an asymptotic probability measure with “independent sampling” is necessarily super-simple of finite rank with D(x=x) = 1. In this note, we show that this independent sampling hypothesis is much stronger than necessary. By examining the Aldous-Hoover-Kallenberg (AHK) presentation of an asymptotic probability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 1998
ISSN: 1042-9832,1098-2418
DOI: 10.1002/(sici)1098-2418(199810/12)13:3/4<229::aid-rsa3>3.0.co;2-x